翻訳と辞書 Words near each other ・ Contract year phenomenon ・ Contract zoning ・ Contracted (film) ・ ContractExpress ・ Contractible space ・ Contractile vacuole ・ Contractility ・ Contracting Officer ・ Contracting Officer's Technical Representative ・ Contraction ・ Contraction (grammar) ・ Contraction (operator theory) ・ Contraction alkalosis ・ Contraction and Convergence ・ Contraction band necrosis ・ Contraction hierarchies ・ Contraction mapping ・ Contraction principle ・ Contraction principle (large deviations theory) ・ Contraction stress test ・ Contractor ・ Contractor management ・ Contractor ratings ・ Contractors and General Workers Trade Union ・ Contractors Bonding v Snee ・ Contracts (Rights of Third Parties) Act 1999 ・ Contracts House ・ Contracts of Employment (Indigenous Workers) Convention ・ Contracts of Employment (Indigenous Workers) Convention, 1939 (shelved) ・ Contracts of Employment (Indigenous Workers) Convention, 1947 (shelved) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Contraction hierarchies ： ウィキペディア英語版 Contraction hierarchies In applied mathematics, the method of contraction hierarchies is a technique to speed up shortest-path routing by first creating precomputed "contracted" versions of the connection graph. It can be regarded as a special case of "highway-node routing". Contraction hierarchies can be used to generate shortest-path routes much more efficiently than Dijkstra's algorithm or previous highway-node routing approaches,〔 and is used in many advanced routing techniques.〔.〕 It is publicly available in open source software to calculate routes from one place to another. ==The algorithm== In general, scalable map routing algorithms have two distinct phases: preprocessing of the original graph (which may take more than an hour to finish) and queries (less than a second). Contraction hierarchy is an extreme case of "hierarchy" approach, which generates a multi-layered node hierarchy in the preprocessing stage. In CH every node in the graph is represented as its own level of hierarchy. This can be achieved in many ways; one simple way is simply to label each node in order of some enumeration from 1 to |N|. More sophisticated approaches might consider the type of road (highway vs minor road, etc.).〔(【引用サイトリンク】title=Efficient Route Planning, Lectures )〕〔 (CC-BY)〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Contraction hierarchies」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.